Properly distributed subsequence on the line
نویسندگان
چکیده
منابع مشابه
On-line & Incremental Update Properties of the Subsequence Automaton
Many works deal with the subsequence matching problem using automata structures. It is to decide, given two sequences s and t, whether s is a subsequence of t. Automata like the Directed Acyclic Subsequence Graph (dasg) or the Subsequence Automaton (sa) accept all subsequences of a set of texts. We focus on this last structure and provide some useful results upon dynamically updates of the sa. ...
متن کاملOn the unconditional subsequence property
We show that a construction of Johnson, Maurey and Schechtman leads to the existence of a weakly null sequence (fi) in ( ∑ Lpi ) 2 , where pi ↓ 1, so that for all ε > 0 and 1 < q 2, every subsequence of (fi) admits a block basis (1+ ε)-equivalent to the Haar basis for Lq . We give an example of a reflexive Banach space having the unconditional subsequence property but not uniformly so. Publishe...
متن کاملsurvey on the rule of the due & hindering relying on the sheikh ansaris ideas
قاعده مقتضی و مانع در متون فقهی کم و بیش مستند احکام قرار گرفته و مورد مناقشه فقهاء و اصولیین می باشد و مشهور معتقند مقتضی و مانع، قاعده نیست بلکه یکی از مسائل ذیل استصحاب است لذا نگارنده بر آن شد تا پیرامون این قاعده پژوهش جامعی انجام دهد. به عقیده ما مقتضی دارای حیثیت مستقلی است و هر گاه می گوییم مقتضی احراز شد یعنی با ماهیت مستقل خودش محرز گشته و قطعا اقتضاء خود را خواهد داشت مانند نکاح که ...
15 صفحه اولOn the Constrained Longest Common Subsequence Problem
The problem of the longest common subsequence is a classical distance measure for strings. There have been several attempts to accommodate longest common subsequences along with some other distance measures. There are a large number of different variants of the problem. In this paper, we consider the constrained longest common subsequence problem for two strings and arbitrary number of constrai...
متن کاملOn the Longest Common Parameterized Subsequence
The well-known problem of the longest common subsequence (LCS), of two strings of lengths n and m respectively, is O(nm)-time solvable and is a classical distance measure for strings. Another well-studied string comparison measure is that of parameterized matching, where two equal-length strings are a parameterized-match if there exists a bijection on the alphabets such that one string matches ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ufa Mathematical Journal
سال: 2015
ISSN: 2074-1863,2074-1871
DOI: 10.13108/2015-7-1-3